Finding Hard Instances of Satisfiability in Łukasiewicz Logics∗
نویسندگان
چکیده
One aspect that has been poorly studied in multiplevalued logics, and in particular in Łukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Łukasiewicz (Ł-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easy-hard-easy pattern and a phase transition phenomenon when testing the satisfiability of Łclausal forms.
منابع مشابه
Complexity of Fuzzy Probability Logics
The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.
متن کاملFinding Hard Instances of Satisfiability in Lukasiewicz Logics
One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz (L-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical i...
متن کاملOn the Undecidability of Fuzzy Description Logics with GCIs with Lukasiewicz t-norm
Recently there have been some unexpected results concerning Fuzzy Description Logics (FDLs) with General Concept Inclusions (GCIs). They show that, unlike the classical case, the DL ALC with GCIs does not have the finite model property under Lukasiewicz Logic or Product Logic and, specifically, knowledge base satisfiability is an undecidable problem for Product Logic. We complete here the analy...
متن کاملFinding Hard Instances of the Satisfiability Problem
Finding sets of hard instances of propositional satissability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the ...
متن کاملOn the relationship between fuzzy autoepistemic logic and fuzzy modal logics of belief
Autoepistemic logic is an important formalism for nonmonotonic reasoning originally intended to model an ideal rational agent reflecting upon his own beliefs. Fuzzy autoepistemic logic is a generalization of autoepistemic logic that allows to represent an agent’s rational beliefs on gradable propositions. It has recently been shown that, in the same way as autoepistemic logic generalizes answer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015